On Rationality of Nonnegative Matrix Factorization | Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n×d matrix W and a nonnegative d×m matrix H. NMF has a wide variety of applications, including bioinformatics, chemometrics, communication complexity, machine learning, polyhedral combinatorics, among many others. A longstanding open question, posed by Cohen and Rothblum in 1993, is whether every rational matrix M has an NMF with minimal d whose factors W and H are also rational. We answer this question negatively, by exhibiting a matrix M for which W and H require irrational entries. As an application of this result, we show that state minimization of labeled Markov chains can require the introduction of irrational transition probabilities. We complement these irrationality results with an NPcomplete version of NMF for which rational numbers suffice.